Computing Representations of Matroids of Bounded Branch-Width
نویسنده
چکیده
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is representable over F ′ and if so, it computes a representation of M over F . The algorithm also counts the number of non-isomorphic representations of M over F . Moreover, it can be modified to list all such non-isomorphic represen-
منابع مشابه
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
We introduce “matroid parse trees” which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounded branch-width over a finite field. We prove that if M is a family of matroids described by a sentence in the monadic second-order logic of matroids, then there is a finite tree automaton accepting exactly those parse trees which build v...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملMonadic second-order model-checking on decomposable matroids
A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the polynomial time model checking of MSOM on representable matroids of bounded branch-width, by reduction to MSO on trees, much simpler than the one previously known. We deduce results about spectrum of MSOM formulas and enumeration on matroids of bounded branch-width. We ...
متن کاملBranch-Width and Well-Quasi-Ordering in Matroids and Graphs
We prove that a class of matroids representable over a fixed finite field and with bounded branch-width is well-quasi-ordered under taking minors. With some extra work, the result implies Robertson and Seymour’s result that graphs with bounded tree-width (or equivalently, bounded branch-width) are well-quasi-ordered under taking minors. We will not only derive their result from our result on ma...
متن کاملAmalgam Width of Matroids
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing the algorithmic application on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order lo...
متن کامل